Papers with direct mapping
Using Intermediate Representations to Solve Math Word Problems (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to solving math word problems do not include higher-order operations that cannot be explicitly represented in equations. |
| Approach: | They propose an iterative labeling framework that generates intermediate forms and executes them to obtain the final answers. |
| Outcome: | The proposed model outperforms existing models in solving math word problems. |
Rethinking-based Code Summarization with Chain of Comments (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods focus on learning a direct mapping from pure code to summaries, overlooking the heterogeneity gap between code and summary. |
| Approach: | They propose a framework that uses chain of comments as auxiliary intermediate information to bridge the gap between code and summaries. |
| Outcome: | The proposed framework outperforms baseline models and multiple code Large Language Models by a large margin. |
Beyond Query Memorization: Large Language Model Routing with Query Decomposition and Historical Matching (2026.acl-long)
Copied to clipboard
Bo Lv, Jingbo Sun, Jianwei Lv, Chen Tang, Shaojie Zhang, Nayu Liu, Guoxin Yu, Zihao Li, Qichao Zhang, Dongbin Zhao, Ping Luo, Yue Yu
| Challenge: | Existing routing methods rely on direct mapping from queries to models based on surface-level features, leading to poor generalizability on out-of-distribution data. |
| Approach: | They propose a new routing framework that recasts the routing task as a matching process of sifting similar queries from historical logs. |
| Outcome: | The proposed framework improves matching accuracy while lowering inference costs . it decouples linguistic surface forms from task-intrinsic requirements . |